Minimal Claw-Free Graphs
نویسندگان
چکیده
A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K1,3 (claw) as an induced subgraph and if, for each edge e of G, G − e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs. MSC 2000: 05C75, 05C07
منابع مشابه
Fachbereich 3 Mathematik Treewidth Equals Bandwidth for At-free Claw-free Graphs Treewidth Equals Bandwidth for At-free Claw-free Graphs
A graph is called AT-free if it does not contain a triple of mutually independent vertices such that, between any two of them, there exists a path that avoids the neighborhood of the third. A triangulation of a graph is a chordal supergraph on the same vertex set. In this paper, the class of AT-free claw-free graphs (i.e., AT-free graphs without an induced K1;3) is characterized as exactly the ...
متن کاملClaw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This paper studies claw-free circular-perfect graphs. First we prove that ifG is a connected claw-free circular-perfect graph with χ(G) > ω(G), then min{α(G), ω(G)} = 2. We use this resu...
متن کاملTraceability in Small Claw-Free Graphs
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices and a minimal number of edges. This complements a result of Matthews on Hamiltonian graphs.
متن کاملTriangulation and Clique Separator Decomposition of Claw-Free Graphs
Finding minimal triangulations of graphs is a well-studied problem with many applications, for instance as first step for efficiently computing graph decompositions in terms of clique separators. Computing a minimal triangulation can be done in O(nm) time and much effort has been invested to improve this time bound for general and special graphs. We propose a recursive algorithm which works for...
متن کاملThe Rank Facets of the Stable Set Polytope for Claw-Free Graphs
This paper provides a complete characterization of all the rank facets of the stable set polytope STAB(G) associated with a claw-free graph G. In particular, it is shown that a claw-free graph G produces a rank facet of STAB(G) if and only if it can be obtained by means of two simple lifting procedures from three basic classes of graphs: (i) cliques, (ii) line graphs of minimal 2-connected hypo...
متن کامل